tKp-saturated graphs of minimum size
نویسندگان
چکیده
A graph G is H-saturated if G does not contain H as a subgraph but for any nonadjacent vertices u and v, G+uv containsH as a subgraph. The parameter sat(H, n) is theminimum number of edges in an H-saturated graph of order n. In this paper, we determine sat(H, n) for sufficiently large nwhen H is a union of cliques of the same order, an arbitrary union of two cliques and a generalized friendship graph. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
On the Number of Edges in a Minimum C6-Saturated Graph
A graph is said to be Ck-saturated if it contains no cycles of length k but does contain such a cycle after the addition of any edge in the complement of the graph. Determining the minimum size of Ck-saturated graphs is one of the interesting problems on extremal graphs. The exact minimum sizes are known for k = 3, 4 and 5, but only general bounds are shown for k ≥ 6. This paper deals with boun...
متن کاملSize of weakly saturated graphs
Let P be a hereditary property. Let kP(G) denote the number of forbidden subgraphs, which are contained in G. A graph G is said to be weakly P-saturated, if G ∈ P and the edges of the complement of G can be labelled e1, e2, . . . , el in such way that for i= 0, 1, . . . , l− 1 the inequality kP(Gi+1)> kP(Gi) holds, whereG0=G,Gi+1=Gi + ei andGl =Kn. The minimum possible size of weakly P-saturate...
متن کاملA Survey of Minimum Saturated Graphs
Given a family of (hyper)graphs F a (hyper)graph G is said to be F-saturated if G is F -free for any F ∈ F but for any edge e in the complement of G the (hyper)graph G + e contains some F ∈ F . We survey the problem of determining the minimum size of an F-saturated (hyper)graph and collect many open problems and conjectures.
متن کاملAneta Dudek , A . Paweł Wojda P m - SATURATED GRAPHS WITH MINIMUM SIZE
By Pm we denote a path of order m. A graph G is said to be Pm − saturated if G has no subgraph isomorphic to Pm and adding any new edge to G creates a Pm in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pm) of Pm-saturated graph and characterize the graphs of Sat(n; Pm) – the set of Pm-saturated graphs of minimum size. They h...
متن کاملThe Edge Spectrum of K4-Saturated Graphs
Any H-free graph G is called H-saturated if the addition of any edge e / ∈ E(G) results in H as a subgraph of G. The minimum size of an H-saturated graph on n vertices is denoted by sat(n,H). The edge spectrum for the family of graphs with property P is the set of all sizes of graphs with property P . In this paper, we find the edge spectrum of K4-saturated graphs. We also show that if G is a K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009